Distinguishing Generation and Selection of Modifier Attachments: Implications for Lexicalized Parsing
نویسندگان
چکیده
We investigated the lexicalization of syntactic knowledge in two reading experiments, one using a moving window paradigm and one measuring eye movements. Our study was motivated by Spivey-Knowlton and Sedivy’s (1995) finding that verb class, and by implication frequency information, determined how easily a prepositional phrase (PP) was attached to a verb phrase (VP) or to a direct object noun phrase (NP). Because they found longer reading times for NP-attached PPs than for VP-attached PPs following action verbs, and the reverse pattern for psych/perception verbs, their data seem to demonstrate that adjunct slots and their frequencies are encoded in the lexical entry of the verb. Such detail is consistent with a highly lexicalized parser, in which both argument and adjunct slots are represented in the lexical entry of each phrasal head. However, we came to different conclusions after using stimuli that were very similar to those used in Spivey-Knowlton and Sedivy, but that compared temporarily ambiguous sentences with unambiguous versions. We essentially replicated the Spivey-Knowlton and Sedivy results using temporarily ambiguous sentences, though the results were not robust in the item analyses. In contrast, with unambiguous versions, we found lexical frequency effects for argument PPs, but not for adjunct PPs. These findings indicate that the lexicalization of syntactic knowledge is limited to argument structure. More generally, this work offers additional support for the distinction between structure generation and selection, and illustrates how factors differentially affecting those processes may be explored empirically.
منابع مشابه
Cascaded Classification for High Quality Head-modifier Pair Selection
This paper presents a cascaded classification approach for selecting head-modifier pairs with high quality from syntactically analyzed sentences. Experimental results show that the proposed approach achieved 76.11% on Fscore of selected head-modifier pairs, which was 8.54% higher than the baseline approach that using sentence length as selection criteria. In addition, compared with using the he...
متن کاملLearning Head-modifier Pairs to Improve Lexicalized Dependency Parsing on a Chinese Treebank
Due to the data sparseness problem, the lexical information from a treebank for a lexicalized parser could be insufficient. This paper proposes an approach to learn head-modifier pairs from a raw corpus, and to integrate them into a lexicalized dependency parser to parse a Chinese Treebank. Experimental results show that this approach not only enlarged the coverage of bi-lexical dependency, but...
متن کاملThe Importance of Lexicalized Syntax Models for Natural Language Generation Tasks
The parsing community has long recognized the importance of lexicalized models of syntax. By contrast, these models do not appear to have had an impact on the statistical NLG community. To prove their importance in NLG, we show that a lexicalized model of syntax improves the performance of a statistical text compression system, and show results that suggest it would also improve the performance...
متن کاملTOWARDS EFFICIENT STATISTICAL PARSING USING LEXICALIZED GRAMMATICAL INFORMATION by
For a long time, the goal of wide-coverage natural language parsers had remained elusive. Much progress has been made recently, however, with the development of lexicalized statistical models of natural language parsing. Although lexicalized tree adjoining grammar (TAG) is a lexicalized grammatical formalism whose development predates these recent advances, its application in lexicalized statis...
متن کاملBilexical Grammars and a Cubic-time Probabilistic Parser
Computational linguistics has a long tradition of lexicalized grammars, in which each grammatical rule is specialized for some individual word. The earliest lexicalized rules were word-specific subcategorization frames. It is now common to find fully lexicalized versions of many grammatical formalisms, such as context-free and tree-adjoining grammars [Schabes et al. 1988]. Other formalisms, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004